A ℂµ Rule for Two-Tiered Parallel Servers
نویسندگان
چکیده
The cμ rule is known to be optimal in many queueing systems with memoryless service and inter-arrival times. We establish a cμ rule for a parallel flexible server system with two tiers. Multiple job classes arrive and wait in separate queues. The first tier contains classes that can only be served by one server each, and the second tier contains a class that can be served by all servers. The cμ preferences give priority to the first tier. Sequencing decisions are made to minimize linear holding costs.
منابع مشابه
A cμ rule for parallel servers with two-tiered cμ preferences
The cμ rule is known to be optimal in many queueing systems with memoryless service times. We establish a cμ rule for a parallel flexible server system with two tiers. Multiple job classes arrive and wait in separate queues. The first tier contains classes that can only be served by one server and the second tier contains a class that can be served by all servers. The cμ preferences give priori...
متن کاملچند پخشی اطلاعات ویدئویی کدشده باH.264 درشبکه های ناهمگن مبتنی بر کدینگ منابع چند پایانه ای
In MTSC, correlated sources are separately encoded but jointly decoded. With appropriate modeling of all kinds of correlation among three non binary correlated sources, in this paper we propose a method for performing IMTSC among three sources. Due to the possibility of providing an approach for practical code design for more than two correlated sources in IMTSC/CEO setup, the multicast system ...
متن کاملQueueing Problems with Two Parallel Servers
A group of agents are waiting for their job to be processed in a facility. We assume that each agent needs the same amount of processing time and incurs waiting costs. The facility has two parallel servers, being able to serve two agents at a time. We are interested in finding the order to serve agents and the (positive or negative) monetary compensations they should receive. We introduce two r...
متن کاملGravitational Search Algorithm to Solve the K-of-N Lifetime Problem in Two-Tiered WSNs
Wireless Sensor Networks (WSNs) are networks of autonomous nodes used for monitoring an environment. In designing WSNs, one of the main issues is limited energy source for each sensor node. Hence, offering ways to optimize energy consumption in WSNs which eventually increases the network lifetime is strongly felt. Gravitational Search Algorithm (GSA) is a novel stochastic population-based meta-...
متن کاملRandomized Assignment of Jobs to Servers in Heterogeneous Clusters of Shared Servers for Low Delay
We consider the job assignment problem in a multi-server system consisting of N parallel processor sharing servers, categorized into M (≪ N) different types according to their processing capacity or speed. Jobs of random sizes arrive at the system according to a Poisson process with rate Nλ. Upon each arrival, a small number of servers from each type is sampled uniformly at random. The job is t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Automat. Contr.
دوره 61 شماره
صفحات -
تاریخ انتشار 2016